package leetcode.weekly.week298;

import leetcode.helper.H;

public class Solution2Test extends H {

	public void debug4(Solution2 so) {
//		H.compare(3, so.minimumNumbers(24, 8));
		H.compare(5, so.minimumNumbers(20, 4));
		H.compare(-1, so.minimumNumbers(10, 8));
		H.compare(3, so.minimumNumbers(19, 3));
		H.compare(-1, so.minimumNumbers(4, 0));
		H.compare(-1, so.minimumNumbers(2, 6));
		H.compare(-1, so.minimumNumbers(2, 8));
		H.compare(5, so.minimumNumbers(5, 1));
		H.compare(1, so.minimumNumbers(1, 1));
		H.compare(2, so.minimumNumbers(58, 9));
		H.compare(-1, so.minimumNumbers(37, 2));
		H.compare(0, so.minimumNumbers(0, 7));
	}

	public void debug3(Solution2 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution2 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution2 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution2Test test = new Solution2Test();
		Solution2 so = new Solution2();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
